Categorical Quantum Computing: Diagrammatic Reasoning for Quantum Algorithms
نویسنده
چکیده
Algorithms for quantum computing are an important cornerstone in the field of quantum technologies. However the language we use to describe them can be clunky and awkward expositions of quantum protocols are often interspersed with explanatory sentences. This inhibits the understanding of such protocols and also the designing of new protocols. In this case study report I discuss a new approach to the language of quantum processes that uses intuitive diagrammatic reasoning backed up with the rigorous mathematics of category theory.
منابع مشابه
BQIABC: A new Quantum-Inspired Artificial Bee Colony Algorithm for Binary Optimization Problems
Artificial bee colony (ABC) algorithm is a swarm intelligence optimization algorithm inspired by the intelligent behavior of honey bees when searching for food sources. The various versions of the ABC algorithm have been widely used to solve continuous and discrete optimization problems in different fields. In this paper a new binary version of the ABC algorithm inspired by quantum computing, c...
متن کاملSynthesising Graphical Theories
In recent years, diagrammatic languages have been shown to be a powerful and expressive tool for reasoning about physical, logical, and semantic processes represented as morphisms in a monoidal category. In particular, categorical quantum mechanics, or “Quantum Picturalism”, aims to turn concrete features of quantum theory into abstract structural properties, expressed in the form of diagrammat...
متن کاملTrichromatic Diagrams for Understanding Qubits
We build on the stream of work of categorical semantics for quantum information processing, first initiated in the seminal paper of Abramsky and Coecke [1]. In this tradition, Coecke and Duncan developed and made extensive use of a calculus of dichromatic diagrams to express quantum protocols and quantum states [2, 3]. This diagrammatic calculus turned out to be universal for quantum computing....
متن کاملSupplementarity is Necessary for Quantum Diagram Reasoning
The ZX-calculus is a powerful diagrammatic language for quantum mechanics and quantum information processing. We prove that its π4 -fragment is not complete, in other words the ZXcalculus is not complete for the so called "Clifford+T quantum mechanics". The completeness of this fragment was one of the main open problems in categorical quantum mechanics, a programme initiated by Abramsky and Coe...
متن کاملHopf Algebras in Quantum Computation
In this thesis, we use string diagrams to study the theory of Hopf algebras in the context of Categorical Quantum Mechanics. First, we treat the theory of representations of a Hopf algebra diagrammatically. The category of representations of a quasitriangular Hopf algebra Rep(H) is a braided tensor category and can be understood as a process theory of particles in Topological Quantum theory. We...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016